On multiple simple recourse models

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On multiple simple recourse models

We consider multiple simple recourse (MSR) models, both continuous and integer versions, which generalize the corresponding simple recourse (SR) models by allowing for a refined penalty cost structure for individual shortages and surpluses. It will be shown that (convex approximations of) such MSR models can be represented as explicitly specified continuous SR models, and thus can be solved eff...

متن کامل

Convex simple integer recourse models

We consider the objective function of a simple recourse problem with fixed technology matrix and integer second-stage variables. Separability due to the simple recourse structure allows to study a one-dimensional version instead. Based on an explicit formula for the objective function, we derive a complete description of the class of probability density functions such that the objective functio...

متن کامل

Simple integer recourse models: convexity and convex approximations

We consider the objective function of a simple recourse problem with fixed technology matrix and integer second-stage variables. Separability due to the simple recourse structure allows to study a one-dimensional version instead. Based on an explicit formula for the objective function, we derive a complete description of the class of probability density functions such that the objective functio...

متن کامل

Distributionally robust simple integer recourse

The simple integer recourse (SIR) function of a decision variable is the expectation of the integer roundup of the shortage/surplus between a random variable with a known distribution and the decision variable. It is the integer analogue of the simple (continuous) recourse function in two stage stochastic linear programming. Structural properties and approximations of SIR functions have been ex...

متن کامل

On the Stability in Stochastic Programming - Generalized Simple Recourse Problems

Stochastic programming problems with simple recourse belong to problems depending on a random element only through the corresponding probability measure. Consequently, this probability measure can be treated as a parameter of the problem. In this paper the stability with respect to the above mentioned parameter will be studied for generalized simple recourse problems.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical Methods of Operations Research

سال: 2005

ISSN: 1432-2994,1432-5217

DOI: 10.1007/s00186-005-0021-9